Intrusive Routing for Improved Standard Cell Pin Access

نویسنده

  • Vishesh Dokania
چکیده

Routability in a standard cell-based physical design flow has emerged as a critical objective in order to meet tight scaling and area requirements while conforming to the increasingly complex design rules. Access to the cell I/O pins can become severely limited based on constraints such as local routing resources, number of tracks, pre-existing nets blocking approach directions, and so on. In this work, we explore a novel approach for enhancing the capabilities of a commercial router aimed at improving pin access and consequently design area utilization. In the proposed intrusive routing methodology, the router would be given the ability to rip-up and change the pre-existing routing configurations inside standard cells, in order to try and achieve a better solution for the particular local scenario. Several approaches are discussed that tradeoff solution optimality with runtime and output reliability. We have implemented a framework tool flow enabling one of the different proposed ideas to validate the idea. As a baseline, this proof-of-concept, sub-optimal implementation achieves equivalent utilization compared to a standard methodology for various routing-constrained design benchmarks. Having thus validated our flow, we seek to incrementally extend the framework towards a complete implementation in the future.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Toward Unidirectional Routing Closure in Advanced Technology Nodes

In advanced technology nodes, unidirectional layout is strongly preferred for high-density metal layers for better manufacturability. The lithography printing of unidirectional layout can be tightly controlled with illumination source optimization and resolution enhancement techniques. Meanwhile, with the unidirectional layout, self-aligned double and quadruple patterning can be applied to achi...

متن کامل

Channel and Pin Assignment for Three Dimensional Packaging Routing

Three dimensional packaging is becoming a popular concept because of the numerous advantages it has to offer over the existing conventional technologies such as PCB and MCM. System on Packages (SOP) is an example of three dimensional packaging. In this paper, we present the channel and pin assignment algorithms for 3D packaging routing. There exist multiple floorplan, routing, and pin distribut...

متن کامل

DRAFT : IEEE TRANSACTIONS ON COMPUTER - AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS , 2001 1 Pseudo Pin Assignment with Crosstalk

| This paper presents a new pseudo pin assignment (PPA) algorithm with crosstalk noise control in multi-layer gridless general-area routing. We propose a two-step approach that considers obstacles and minimizes the weighted sum of total wire length and the estimated number of vias under crosstalk noise constraints. We test our algorithms on a set of MCM examples and a set of standard cell examp...

متن کامل

Multilayer pin assignment for macro cell circuits

We present a pin-assignment algorithm based on a new multi-layer chip-level global router. Combining pin assignment and global routing has been an important approach for the pin-assignment problem. But there are many difficulties when combining the two processes. In the past, only specialized global routing methods were used in the combined process. In our pin assignment program, we use an actu...

متن کامل

An Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery

The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017